An Operational Semantics for the Extended Compliance Rule Graph Language
نویسندگان
چکیده
A challenge for any enterprise is to ensure conformance of its business processes with imposed compliance rules. Usually, the latter may constrain multiple perspectives of a business process, including control flow, data, time, resources, and interactions with business partners. Like for process modeling, intuitive visual languages have been proposed for specifying compliance rules. However, business process compliance cannot completely be decided at design time, but needs to be monitored during run time as well. In previous work we introduced the extended Compliance Rule Graph (eCRG) language that enables the visual monitoring of business process compliance regarding the control flow, data, time, and resource perspectives as well as the interactions a process has with business partners. This technical report introduces an operational semantics of the eCRG language. In particular, the state of a visual compliance rule is reflected through markings and annotations of an eCRG. The proposed operational semantics not only allows detecting compliance violations at run-time, but visually highlights their causes as well. Finally, it allows providing recommendations to users in order to proactively ensure for a compliant continuation of a running business process. This work was done within the research project CPro funded by the German Research Foundation (DFG) under project number RE 1402/2-1. 2 David Knuplesch and Manfred Reichert
منابع مشابه
On the Formal Semantics of the Extended Compliance Rule Graph
A fundamental challenge for any process-aware information system is to ensure compliance of modeled and executed business processes with imposed compliance rules stemming from guidelines, standards and laws. Such compliance rules usually refer to multiple process perspectives including control flow, data, time, and resources as well as interactions with business partners. On one hand, complianc...
متن کاملA Hoare Calculus for Graph Programs
We present Hoare-style axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The preand postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP’s conditional rule schemata and infinite label alphabet. We show that the proof rules a...
متن کاملA Visual Language for Modeling Multiple Perspectives of Business Process Compliance Rules (Extended Abstract)
A fundamental challenge for enterprises is to ensure compliance of their business processes with imposed compliance rules stemming from various sources, e.g., corporate guidelines, best practices, standards, and laws. In general, a compliance rule may refer to multiple process perspectives including control flow, time, data, resources, and interactions with business partners. On one hand, compl...
متن کاملThe Semantics of Graph Programs
GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graphtransformation rules, sequential composition, branching and iteration. We present a formal semantics ...
متن کاملAutomatic Generation of Model-to-Model Transformations from Rule-Based Specifications of Operational Semantics
In this paper we present a new approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of a graph grammar. The approach is oriented to the design of transformations from Domain-Specific Visual Languages (DSVLs) into semantic domains with an explicit notion of transition, such as Petri nets. We illus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015